An Operational Characterization of the Notion of Probability by Algorithmic Randomness
نویسنده
چکیده
The notion of probability plays an important role in almost all areas of science. In modern mathematics, however, probability theory means nothing other than measure theory, and an operational characterization of the notion of probability is not established yet. In this paper, based on the toolkit of algorithmic randomness we present an operational characterization of the notion of probability in the case where the sample space of the underlying probability space is finite. Keywords— probability, algorithmic randomness, operational characterization, Martin-Löf randomness, Bernoulli
منابع مشابه
An Operational Characterization of the Notion of Probability by Algorithmic Randomness and Its Application to Cryptography
The notion of probability plays an important role in almost all areas of science, including cryptography. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion of probability is not established yet. In this paper, based on the toolkit of algorithmic randomness we present an operational characterization of t...
متن کاملAlgorithmic Information Theory and Kolmogorov Complexity
This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover basic notions of algorithmic information theory: Kolmogorov complexity (plain, conditional, prefix), notion of randomness (Martin-Löf randomness, Mises–Church randomness), Solomonoff universal a priori probability and their properties (symmetry of information, connection between a priori probabil...
متن کاملRunning head : RANDOMNESS AS INFERENCE 1 Subjective randomness as statistical inference
Some events seem more random than others. For example, when tossing a coin, a sequence of eight heads in a row does not seem very random. Where do these intuitions about randomness come from? We argue that subjective randomness can be understood as the result of a statistical inference assessing the evidence that an event provides for having been produced by a random generating process. We show...
متن کاملAnother Example of Higher Order Randomness
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability that a program for infinite computations (a program that never halts) outputs a cofinite set is random in the second jump of the halting problem. Indeed, we prove that is exactly as random as the halting probability of a universal machine equipped with an oracle for the second jump of the halti...
متن کاملStationary algorithmic probability
Kolmogorov complexity and algorithmic probability quantify the randomness and universal a priori probability of finite binary strings. Nevertheless, they share the disadvantage of depending on the choice of the universal computer which is used as a reference computer to count the program lengths. In this paper, we propose an approach to algorithmic probability that tries to eliminate this machi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014